DE eng

Search in the Catalogues and Directories

Hits 1 – 9 of 9

1
Universal Dependencies 2.1
In: https://hal.inria.fr/hal-01682188 ; 2017 (2017)
BASE
Show details
2
When is multitask learning effective? Semantic sequence prediction under varying data conditions
In: EACL 2017 - 15th Conference of the European Chapter of the Association for Computational Linguistics ; https://hal.inria.fr/hal-01677427 ; EACL 2017 - 15th Conference of the European Chapter of the Association for Computational Linguistics, Apr 2017, Valencia, Spain. pp.1-10 ; http://eacl2017.org/ (2017)
BASE
Show details
3
Parsing Universal Dependencies without training
In: Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, ; EACL 2017 - 15th Conference of the European Chapter of the Association for Computational Linguistics ; https://hal.inria.fr/hal-01677405 ; EACL 2017 - 15th Conference of the European Chapter of the Association for Computational Linguistics, Apr 2017, Valencia, Spain. pp.229 - 239 ; http://eacl2017.org/ (2017)
BASE
Show details
4
Universal Dependencies 2.0 alpha (obsolete)
Nivre, Joakim; Agić, Željko; Ahrenberg, Lars. - : Universal Dependencies Consortium, 2017
BASE
Show details
5
Universal Dependencies 2.0
Nivre, Joakim; Agić, Željko; Ahrenberg, Lars. - : Universal Dependencies Consortium, 2017
BASE
Show details
6
Universal Dependencies 2.0 – CoNLL 2017 Shared Task Development and Test Data
Nivre, Joakim; Agić, Željko; Ahrenberg, Lars. - : Universal Dependencies Consortium, 2017
BASE
Show details
7
Universal Dependencies 2.1
Nivre, Joakim; Agić, Željko; Ahrenberg, Lars. - : Universal Dependencies Consortium, 2017
BASE
Show details
8
ALL-IN-1: Short Text Classification with One Model for All Languages ...
Plank, Barbara. - : arXiv, 2017
BASE
Show details
9
Parsing Universal Dependencies without training ...
Abstract: We propose UDP, the first training-free parser for Universal Dependencies (UD). Our algorithm is based on PageRank and a small set of head attachment rules. It features two-step decoding to guarantee that function words are attached as leaf nodes. The parser requires no training, and it is competitive with a delexicalized transfer system. UDP offers a linguistically sound unsupervised alternative to cross-lingual parsing for UD, which can be used as a baseline for such systems. The parser has very few parameters and is distinctly robust to domain change across languages. ... : EACL 2017, 8+2 pages ...
Keyword: Computation and Language cs.CL; FOS Computer and information sciences
URL: https://dx.doi.org/10.48550/arxiv.1701.03163
https://arxiv.org/abs/1701.03163
BASE
Hide details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
9
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern